Provably Secure IdentityBased Signature Scheme in the Standard Model

doi:10.13190/jbupt.201101.99.mingy

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2011, Vol. 34 ›› Issue (1): 99-102.doi: 10.13190/jbupt.201101.99.mingy

• Reports • Previous Articles Next Articles

Provably Secure IdentityBased Signature Scheme in the Standard Model

Received:2010-02-01 Revised:2010-04-14 Online:2011-02-28 Published:2011-02-28

Abstract

Abstract:

Based on the bilinear pairings, an identitybased signature scheme is presented to overcome the loose security reduction of PatersonSchuldt’s identitybased signature scheme which is proved secure in the standard model. Using the idea of private key generation algorithm in Waters’ and Gentry’s identitybased encryption scheme, the scheme can answer all private key queries and signature queries, which captures tighter secure reduction and weak secure assumption. The scheme is also provably secure in the standard model. A security analysis shows that the proposed scheme is proved secure against existential forgery on the adaptively chosen message attack under the assumption of modify computational DiffieHellman.

Key words: standard model, identitybased signature, bilinear pairings, security reduction

References

[1] Shamir A. Identity-based cryptosystems and signature schemes//Crypto’84. Berlin: Springer-Verlag, 1984: 47-53. [2] Boneh D, Franklin M K. Identity-based encryption from the Weil pairing//Crypto’01. Berlin: Springer-Verlag, 2001: 213-229. [3] Paterson K G. ID-based signatures from pairings on elliptic curves[J]. IEEE Commun Letters, 2002, 38(18): 1025-1026. [4] Hess F. Efficient identity based signature schemes based on pairings//SAC’02. Berlin: Springer-Verlag, 2002: 310-324. [5] Cha J C, Cheon J H. An identity-based signature from gap Diffie-Hellman groups//PKC’03. Berlin: Springer-Verlag, 2003: 18-30. [6] Barreto P S L M, Libert B, McCullagh N, et al. Efficient and provably-secure identity-based signatures and signcryption from bilinear maps//Asiacrypt’05. Berlin: Springer-Verlag, 2005: 515-532. [7] 崔巍, 辛阳, 胡程瑜, 等. 高效的基于身份的(受限)部分盲签名[J]. 北京邮电大学学报, 2008, 31(4): 53-57. Cui Wei, Xin Yang, Hu Chengyu, et al. Efficient ID-based (restrictive) partially blind signature[J]. Journal of Beijing University of Posts and Telecommunications, 2008, 31(4): 53-57. [8] Paterson K G, Schuldt J C N. Efficient identity-based signatures secure in the standard model//ACISP’06. Berlin: Springer-Verlag, 2006: 207-222. [9] 冯登国. 可证明安全性理论与方法研究[J]. 软件学报, 2005, 16(10): 1743-1756. Feng Dengguo. Research on theory and approach of provable security[J]. Journal of Software, 2005, 16(10): 1743-1756. [10] Libert B, Quisquater J J. The exact security of an identity based signature and its applications. (2004). Http://eprint.iacr.org. [11] Coron J S. On the exact security of full domain hash//Crypto’00. Berlin: Springer-Verlag, 2000: 229-235. [12] Katz J, Wang N. Efficiency improvements for signature schemes with tight security reductions//ACMCCS’03. : ACM Press, 2003: 155-164. [13] Waters B. Efficient identity-based encryption without random oracles//Eurocrypt’05. Berlin: Springer-Verlag, 2005: 114-127. [14] Gentry C. Practical identity-based encryption without random oracles//Eurocrypt’06. Berlin: Springer-Verlag, 2006: 445-464. [15] 明洋,王育民. 有效的无证书签名方案[J]. 电子科技大学学报, 2008, 37(2): 175-177. Ming Yang, Wang Yumin. Efficient certificateless signature scheme based on bilinear pairings[J]. Journal of University of Electronic Science and Technology of China, 2008, 37(2): 175-177. [16] Bao Feng, Deng R, Zhu Huafei. Variations of Diffie-Hellman problem//ICICS’03. Berlin: Springer-Verlag, 2003: 301-312.

Provably Secure IdentityBased Signature Scheme in the Standard Model

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 10

Recommended Articles

Metrics

Comments

[1]	TANG Yong-li, HU Ming-xing, YE Qing, QIN Pan-ke, YU Jin-xia. Improved Multi-Identity Based Fully Homomorphic Encryption Scheme over Lattices [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2018, 41(1): 125-133.
[2]	ZHOU Cai-xue. Cryptanalysis and Improvement of Certificate-Based Signature Scheme [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2013, 36(6): 98-101.
[3]	. Cryptanalysis and Improvement of a Certificateless  Strong Proxy Signature Scheme [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2011, 34(5): 115-118.
[4]	Qing Wu. New Strongly Unforgeable IdentityBased Signature  Scheme in the Standard Model [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2011, 34(3): 71-74.
[5]	. Short Signcryption Scheme with Forward Security and Ciphertext Anonymity [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2010, 33(4): 131-134.
[6]	. Provable Secure Identity-based Threshold Signcryption Scheme in the Standard Model [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2010, 33(2): 11-15.
[7]	SUN Shi-feng；WEN Qiao-yan. An Attack on a Certificateless Strong Proxy Signature Scheme and Its Improvement [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2010, 33(1): 80-83.
[8]	DU Hong-zhen1.2, WEN Qiao-yan1, LI Wen-min1, JIN Zheng-ping1. Efficient Certificateless Strong Proxy Signature Scheme [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2008, 31(6): 18-21.
[9]	WANG Ling-ling, ZHANG Guo-yin, MA Chun-guang . A Short Linkable Ring Signature Scheme for E-Cash Protocol [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2008, 31(1): 102-106.
[10]	YU Yong1, YANG Bo2, LI Fa-gen1, ZHANG Ming-wu2. An Efficient Proxy Ring Signature Scheme [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2007, 30(3): 23-26.